On r-dynamic coloring of comb graphs

An r-dynamic coloring of a graph G is proper such that every vertex in V(G) has neighbors at least $\min\{d(v),r\}$ different color classes. The chromatic number denoted as $\chi_r (G)$, the k coloring. In this paper we obtain central graph, middle total line para-line and sub-division comb $P_n\odot K_1$ by $C(P_n\odot K_1), M(P_n\odot T(P_n\odot L(P_n\odot P(P_n\odot K_1)$ $S(P_n\odot respectively finding upper bound lower for Comb graph.